Hamiltonian path problem - PDFSEARCH.IO - Document Search Engine

Hamiltonian path problem
Results: 50

#	Item
41	Undirected Graphs and Networks Networks and graphs A network is a collection of objects connected to each other in some specific way. A graph is a finite set of dots called vertices (or nodes) connected by links called e Add to Reading List Source URL: www.di-mgt.com.au Language: English - Date: 2003-09-21 13:50:00 Graph connectivity Graph coloring Hamiltonian path Eulerian path Path Graph Spanning tree Tree Route inspection problem Graph theory Theoretical computer science NP-complete problems
42	How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling Add to Reading List Source URL: clerc.maurice.free.fr Language: English - Date: 2012-11-29 03:08:56 NP-complete problems Travelling salesman problem Graph coloring Hamiltonian path Connectivity Edge coloring Bellman–Ford algorithm Graph theory Theoretical computer science Mathematics
43	Design and Analysis of Algorithms CS681 Fall 2007 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2007-10-28 15:28:40 NP-complete problems Travelling salesman problem Matching Eulerian path Hamiltonian path Christofides algorithm Connectivity Graph Graph theory Mathematics Theoretical computer science
44	An Experimental Study of Minimum Mean Cycle Algorithms Loukas Georgiadis1 Add to Reading List Source URL: www.siam.org Language: English - Date: 2010-03-18 09:58:54 NP-complete problems Routing algorithms Connectivity Spanning tree Graph Hamiltonian path Bellman–Ford algorithm Shortest path problem Cycle graph Graph theory Mathematics Theoretical computer science
45	Discrete Applied Mathematics[removed] – 158 www.elsevier.com/locate/dam Add to Reading List Source URL: www.mit.edu Language: English - Date: 2007-01-24 18:30:31 NP-complete problems Hamiltonian path Line graph Hamiltonian completion Graph Travelling salesman problem Petersen graph Hamiltonian path problem Graph theory Theoretical computer science Mathematics
46	Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 11, no. 1, pp. 61–[removed]) Add to Reading List Source URL: jgaa.info Language: English - Date: 2007-05-02 06:33:52 NP-complete problems Hamiltonian path Line graph Path Cubic graph Graph Travelling salesman problem Matching Neighbourhood Graph theory Mathematics Theoretical computer science
47	PDF Document Add to Reading List Source URL: www.maths.qmul.ac.uk Language: English - Date: 2000-09-08 11:02:18 Combinatorial optimization Bipartite graph Adjacency matrix Graph Eulerian path Petersen graph Hamiltonian path Maximum flow problem Tree Graph theory Mathematics Matching
48	PDF Document Add to Reading List Source URL: www.cs.rhul.ac.uk Language: English - Date: 2005-01-12 05:25:58 Travelling salesman problem NP-complete problems Approximation algorithms Operations research Graph Nearest neighbour algorithm Concorde TSP Solver Hamiltonian path Optimization problem Theoretical computer science Mathematics Graph theory
49	PDF Document Add to Reading List Source URL: ling.umd.edu Language: English - Date: 2009-08-01 00:43:08 Applied mathematics NP-complete Optimality theory NP-hard NP Hamiltonian path problem Complete Strongly NP-complete Co-NP Theoretical computer science Computational complexity theory Complexity classes
50	PDF Document Add to Reading List Source URL: jsat.ewi.tudelft.nl Language: English - Date: 2008-05-07 17:14:15 NP-complete problems Boolean algebra Hamiltonian path Gray code Boolean satisfiability problem Conjunctive normal form Induced path Propositional formula Cube Mathematics Theoretical computer science Graph theory